Deleted DOI

Vertex-deleted and Edge-deleted Subgraphs

The foremost problem in this area of graph theory is the Reconstruction Conjecture which states that a graph is reconstructible from its collection of vertex-deleted subgraphs. In spite of several attempts to prove the conjecture only very partial results have been obtained. Several of these results do however bring to light interesting structural relationships between a graph and its subgraphs...

Deleted Products of Cones

Identification of deleted consonants.

VC transitions have often been found to be better cues for the identification of deleted consonants than CV transitions. The lower score for CV transitions could very well be due to an interfering "click sensation" caused by the abrupt begining of these transitions. In the present investigation the abrubt onset was eliminated by replacing the deleted portions of the consonants with noise bursts...

archived; figs deleted here; HP4

The search for cold dark-matter WIMP particles is now entering the level of supersymmetric particle sensitivity. It is considered that the most likely neutralino mass is of order 100 GeV and the expected interaction rate is from 10 10 events/kg/day. In order to carry out a successful search, we need (1) a massive (~50kg) powerful background-discriminating detector, and (2) a high-A target to ma...

Chromaticity of Turan Graphs with At Most Three Edges Deleted

Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...